Eecient Organization of Control Structures in Distributed Implementations
نویسندگان
چکیده
A new technique for the management of control structures in distributed implementations of dynamic process systems is presented. Instead of storing the runtime stacks of parallel processes as linked lists of activation blocks in a heap structure, the local stacks of several parallel processes, which are executed on the same processor element, are stored in an interleaved manner on a single physical stack (within each processor element), called the meshed stack. The technique ensures that there is almost no overhead for the evaluation of single processes due to the parallel environment. In principle, the meshed stack technique is independent of the implemented language. We explain it for the parallel implementation of functional languages.
منابع مشابه
Parallel Functional Implementations: Graphbased vs. Stackbased Reduction
The meshed stack is a technique for the management of control structures in distributed implementations of dynamic process systems. In the environment of a parallel abstract machine for the execution of functional programs, we compare this approach to the classical graphbased reduction technique. Experimental results will show, that the stackbased reduction is more eecient in space and time, es...
متن کاملEecient, Strongly Consistent Implementations of Shared Memory
We present linearizable implementations for two distributed organizations of multiprocessor shared memory. For the full caching organization , where each process keeps a local copy of the whole memory, we present a linearizable implementations of read/write memory objects that achieves essentially optimal eeciency and allows quantitative degradation of the less frequently employed operation. Fo...
متن کاملEfficient Organization of Control Structures in Distributed Implementations
A new technique for the management of control structures in distributed implementations of dynamic process systems is presented. Instead of storing the runtime stacks of parallel processes as linked lists of function blocks in a heap structure, the local stacks of several parallel processes, which are executed on the same processor element, are stored in an interleaved manner on a single physic...
متن کاملModeling Multi-Dimensional Data and Control ow
Multi-dimensional (M-D) signal processing is a key component of most real-time signal and data processing VLSI systems in industry. Handling the M-D nature of data in an eecient way is crucial to arrive at acceptable system implementations. This aspect of design has often been ignored up to now in high-level synthesis. In this paper, a polyhedral based model is presented for the linear, piece-w...
متن کاملParallel Priority Queues on Cray - T
We examine the design, implementation, and experimental analysis of parallel priority queues for network simulation. We consider: a) distributed splay trees using MPI, b) concurrent heaps using shared memory atomic locks, and c) a new, more general concurrent data structure based on distributed sorted lists, which is designed to provide dynamically balanced work allocation (with automatic or ma...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994